The Δ2-conjecture for L(2, 1)-labelings is true for direct and strong products of graphs
نویسندگان
چکیده
A variation of the channel assignment problem is naturally modeled by L(2, 1)-labelings of graphs. An L(2, 1)-labeling of a graph G is an assignment of labels from {0, 1, . . . , λ} to the vertices of G such that vertices at distance two get different labels and adjacent vertices get labels that are at least two apart and the λ-number λ(G) of G is the minimum value λ such that G admits an L(2, 1)-labeling. The ∆-conjecture asserts that for any graph G its λ-number is at most the square of its largest degree. In this paper it is shown that the conjecture holds for graphs that are direct or strong products of nontrivial graphs. Explicit labelings of such graphs are also constructed.
منابع مشابه
The ∆-conjecture for L(2, 1)-labelings is true for direct and strong products of graphs
A variation of the channel assignment problem is naturally modeled by L(2, 1)-labelings of graphs. An L(2, 1)-labeling of a graph G is an assignment of labels from {0, 1, . . . , λ} to the vertices of G such that vertices at distance two get different labels and adjacent vertices get labels that are at least two apart and the λ-number λ(G) of G is the minimum value λ such that G admits an L(2, ...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملConstructions of antimagic labelings for some families of regular graphs
In this paper we construct antimagic labelings of the regular complete multipartite graphs and we also extend the construction to some families of regular graphs.
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. on Circuits and Systems
دوره 53-II شماره
صفحات -
تاریخ انتشار 2006